Analysis of Layered Hierarchies for Necklaces
نویسندگان
چکیده
We study a hierarchical approach for modeling deformable necklaces. A recent paper by Guibas et al. [5] introduced two hierarchies, wrapped and layered. They proved that the wrapped hierarchy admits a separating family of size O(n2−2/d). The main result of this paper is that the same bound holds for the layered hierarchy. The layered hierarchy has some advantages compared with wrapped hierarchy. We show that it can be modified so that conformational changes can be handled efficiently.
منابع مشابه
Analysis of Layered Hierarchy for Necklaces
Molecular configurations can be modeled as sets of spheres in 3D. By imposing geometric constraints on the spheres based on molecular biology one can apply efficient techniques [3], for example, to analyze the complexity of molecular surface [1]. Guibas et al. [2] introduced a model called necklace that finds applications in computer graphics, computer vision, robotics, geographic information s...
متن کاملA Finite Volume Formulation for the Elasto-Plastic Analysis of Rectangular Mindlin-Reissner Plates, a Non-Layered Approach
This paper extends the previous work of authors and presents a non-layered Finite Volume formulation for the elasto-plastic analysis of Mindlin-Reissner plates. The incremental algorithm of the elasto-plastic solution procedure is shown in detail. The performance of the formulation is examined by analyzing of plates with different boundary conditions and loading types. The results are illustrat...
متن کاملPoliteness Orientation in Social Hierarchies in Urdu
The present research is aimed at investigating how the politeness of the speakers of Urdu is influenced by their relative social status in society. The researcher took politeness theory of Brown and Levinson (1978, 1987) as a model. To observe politeness of Urdu speakers, speech act of apology with different strategies was selected. A Discourse Completion Task (DCT) was used as an instrument to...
متن کاملA Gray code for fixed-density necklaces and Lyndon words in constant amortized time
This paper develops a constant amortized time algorithm to produce a cyclic cool-lex Gray code for fixed-density binary necklaces, Lyndon words, and pseudo-necklaces. It is the first Gray code for these objects that achieves this time bound. The algorithm is applied: (i) to develop a constant amortized time cyclic Gray code for necklaces, Lyndon words, and pseudo-necklaces ordered by density an...
متن کاملA CAT Gray code for fixed-density necklaces and Lyndon words
This paper develops a constant amortized time algorithm to produce the cyclic cool-lex Gray code for fixed-density binary necklaces, Lyndon words, and pseudo-necklaces. It is the first Gray code for these objects that achieves this time bound. In addition to Gray code order, the algorithms can be easily modified to output the strings in co-lex order.
متن کامل